Noiseless coding of correlated information sources

نویسندگان

  • David S. Slepian
  • Jack K. Wolf
چکیده

A new class of lower bounds to rate-distortion functions ofstationary processes with memory and single-letter vector-valued distor-tion measures is derived. This class is shown to include or imply all otherwell-known lower bounds to rates of such sources and distortion measures.The derivation is based on the definition and properties of the conditionalratedistortion function. In addition to providing a unified and intuitive Manuscript received May 2, 1972; revised September 6, 1972. Thiswork was supported in part by the National ScienceFoundation underGrants GK-5452 and GK-31630 and by the Joint Service Program atStanford Electronics Laboratory under U.S. Navy Contract N00014-67-A-0112-004.The author is with the Department of Electrical Engineering,Stanford University, Stanford, Calif. 94305.approach to lower bounds, this approach yields several interesting rela-tions among conditional, joint, and marginal rates that are similar toand sometimes identical with the analogous relations among the corre-sponding entropies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Noiseless coding theorem proved by induction for finite stationary memoryless information sources

Noiseless coding theorem for finite stationary memoryless information sources is proved by using induction on the number of source symbols and the inequality of geometric and harmonic means.

متن کامل

A progressive universal noiseless coder

AbstructWe combine pruned tree-structured vector quantization (pruned TSVQ) with Itoh’s universal noiseless coder. By combining pruned TSVQ with universal noiseless coding, we benefit from the “successive approximation” capabilities of TSVQ, thereby allowing progressive transmission of images, while retaining the ability to noiselessly encode images of unknown statistics in a provably asymptoti...

متن کامل

The role of the asymptotic equipartition property in noiseless source coding

The (noiseless) fixed-length source coding theorem states that, except for outcomes in a set of vanishing probability, a source can be encoded at its entropy but not more efficiently. It is well known that the Asymptotic Equipartition Property (AEP) is a sufficient condition for a source to be encodable at its entropy. This paper shows that the AEP is necessary for the source coding theorem to ...

متن کامل

Efficient universal noiseless source codes

Although the existence of universal noiseless variable-rate codes for the class of discrete stationary ergodic sources has previously been established, very few practical universal encoding methods are available. Efficient implementable universal source coding techniques are discussed in this paper. Results are presented on source codes for which a small value of the maximum redundancy is achie...

متن کامل

Second-order noiseless source coding theorems

I. Kontoyiannis Appeared in IEEE Trans. Inform. Theory, 43, pp. 1339 1341, July 1997. Abstract { Shannon's celebrated source coding theorem can be viewed as a \one-sided law of large numbers." We formulate second-order noiseless source coding theorems for the deviation of the codeword lengths from the entropy. For a class of sources that includes Markov chains we prove a \one-sided central limi...

متن کامل

A Vector Quantization Approach to Universal Noiseless Coding and Quantization - Information Theory, IEEE Transactions on

A two-stage code is a block code in which each block of data is coded in two stages: the first stage codes the identity of a block code among a collection of codes, and the second stage codes the data using the identified code. The collection of codes may he noiseless codes, fixed-rate quantizers, or variable-rate quantizers. We take a vector quantization approach to twostage coding, in which t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 19  شماره 

صفحات  -

تاریخ انتشار 1973